Zero-sum game

Results: 139



#Item
31Econometrica, Vol. 74, No. 2 (March, 2006), 397–429  HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim

Econometrica, Vol. 74, No. 2 (March, 2006), 397–429 HARD-TO-SOLVE BIMATRIX GAMES BY RAHUL SAVANI AND BERNHARD VON STENGEL1 The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bim

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2006-03-03 11:56:34
32arXiv:1211.2405v1  [cs.GT]  11 Nov 2012

arXiv:1211.2405v1 [cs.GT] 11 Nov 2012

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2012-11-13 09:27:35
33INFOCOMMUNICATIONS JOURNAL  1 Modeling Content-Adaptive Steganography with Detection Costs as a Quasi-Zero-Sum Game

INFOCOMMUNICATIONS JOURNAL 1 Modeling Content-Adaptive Steganography with Detection Costs as a Quasi-Zero-Sum Game

Add to Reading List

Source URL: aronlaszka.com

Language: English - Date: 2014-11-20 15:28:29
    34Work and Life: The End of the Zero-Sum Game by Stewart D. Friedman, Perry Christensen, and Jessica DeGroot Harvard Business Review

    Work and Life: The End of the Zero-Sum Game by Stewart D. Friedman, Perry Christensen, and Jessica DeGroot Harvard Business Review

    Add to Reading List

    Source URL: worklife.wharton.upenn.edu

    Language: English - Date: 2013-01-07 12:26:02
      35The Zero Sum Game Being Played with Georgia’s Education: How Opportunity

      The Zero Sum Game Being Played with Georgia’s Education: How Opportunity

      Add to Reading List

      Source URL: pv.gae2.org

      Language: English - Date: 2015-08-27 10:18:52
        36Bayesian Persuasion Emir Kamenica and Matthew Gentzkow∗ University of Chicago SeptemberAbstract

        Bayesian Persuasion Emir Kamenica and Matthew Gentzkow∗ University of Chicago SeptemberAbstract

        Add to Reading List

        Source URL: www.najecon.org

        Language: English - Date: 2011-01-27 15:15:19
        37Intrinsic Robustness of the Price of Anarchy Tim Roughgarden Department of Computer Science Stanford University 353 Serra Mall, Stanford, CA 94305

        Intrinsic Robustness of the Price of Anarchy Tim Roughgarden Department of Computer Science Stanford University 353 Serra Mall, Stanford, CA 94305

        Add to Reading List

        Source URL: theory.stanford.edu

        Language: English - Date: 2012-05-15 15:01:36
        38Computing Correlated Equilibria in Multi-Player Games∗ Christos H. Papadimitriou† Tim Roughgarden‡  January 5, 2008

        Computing Correlated Equilibria in Multi-Player Games∗ Christos H. Papadimitriou† Tim Roughgarden‡ January 5, 2008

        Add to Reading List

        Source URL: theory.stanford.edu

        Language: English - Date: 2008-01-28 00:27:47
        39Overview  Game theory Martin Dufwenberg∗ Game theory is a toolkit for examining situations where decision makers influence each other. I discuss the nature of game-theoretic analysis, the history of game

        Overview Game theory Martin Dufwenberg∗ Game theory is a toolkit for examining situations where decision makers influence each other. I discuss the nature of game-theoretic analysis, the history of game

        Add to Reading List

        Source URL: www.u.arizona.edu

        Language: English - Date: 2011-02-11 15:32:17
        40Algorithmic Game Theory - handout4 Uriel Feige 18 April 2013 Homework. Please keep the answers to the following questions short and easy to read. 1. Prove that for every finite two-player zero-sum game, in every Nash eq

        Algorithmic Game Theory - handout4 Uriel Feige 18 April 2013 Homework. Please keep the answers to the following questions short and easy to read. 1. Prove that for every finite two-player zero-sum game, in every Nash eq

        Add to Reading List

        Source URL: www.wisdom.weizmann.ac.il

        Language: English - Date: 2013-04-18 05:42:10